Towards parallel evaluation and learning of Boolean μ-formulas with molecules
نویسندگان
چکیده
A {formula is a Boolean formula in which each variable occurs at most once. The paper treats its molecular representation including its queries using techniques in molecular biology. The novelty is that this method can evaluate a Boolean formula in a single tube within a short time. The preliminary experimental result suggests the possibility of parallel evaluation and learning of general {formulas. This method is essentially a simulation of state transitions and can be used to simulate a decision tree or a state machine.
منابع مشابه
QFUN: Towards Machine Learning in QBF
This paper reports on the QBF solver QFUN that has won the non-CNF track in the recent QBF evaluation. The solver is motivated by the fact that it is easy to construct Quantified Boolean Formulas (QBFs) with short winning strategies (Skolem/Herbrand functions) but are hard to solve by nowadays solvers. This paper argues that a solver benefits from generalizing a set of individual wins into a st...
متن کاملSlicing Distributed Programs
– Instead of defining both Ctl formulas and least fixed point computation algorithms, program slicing can be described as a μ-calculus formula [11] only. This greatly simplifies the definition of existing classes of program slicing (backward/forward/chopping, static/dynamic/hybrid/conditioned, syntaxpreserving/amorphous) in a unified and concise framework. Due to its capability of defining both...
متن کاملAn Improved Algorithm for Network Reliability Evaluation
Binary Decision Diagram (BDD) is a data structure proved to be compact in representation and efficient in manipulation of Boolean formulas. Using Binary decision diagram in network reliability analysis has already been investigated by some researchers. In this paper we show how an exact algorithm for network reliability can be improved and implemented efficiently by using CUDD - Colorado Univer...
متن کاملClause/Term Resolution and Learning in the Evaluation of Quantified Boolean Formulas
Resolution is the rule of inference at the basis of most procedures for automated reasoning. In these procedures, the input formula is first translated into an equisatisfiable formula in conjunctive normal form (CNF) and then represented as a set of clauses. Deduction starts by inferring new clauses by resolution, and goes on till the empty clause is generated or satisfiability of the set of cl...
متن کاملMPIDepQBF: Towards Parallel QBF Solving without Knowledge Sharing
Inspired by recent work on parallel SAT solving, we present a lightweight approach for solving quantified Boolean formulas (QBFs) in parallel. In particular, our approach uses a sequential state-of-the-art QBF solver to evaluate subformulas in working processes. It abstains from globally exchanging information between the workers, but keeps learnt information only locally. To this end, we equip...
متن کامل